Transition time asymptotics of queue-based activation protocols in random-access networks

Random access protocols based on rateless codes

We present two coded random access protocols that rely on the ideas of rateless codes and Successive Interference Cancellation (SIC). The rateless aspect is seen in that the contention period continues until the Base Station (BS) decides that a sufficient fraction of users has been resolved. The first protocol is referred to as frameless ALOHA, in which a device transmits the packet multiple ti...

Waiting Time Asymptotics in the Single Server Queue with Service in Random Order

We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals and regularly varying service time distribution with index −ν, it is shown that the waiting time distribution is also regularly varying, with index 1− ν, and...

Queue-Based Random-Access Algorithms: Fluid Limits and Stability Issues

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...

Opportunistic Two - Way Protocols for Random Access Networks

Optical CDMA Random Access Protocols

–The link layer of an optical directdetection code-division-multiple access packet network is considered. Three different protocols are proposed. Two of them need pretransmission coordination, whereas the third one does not. Both system throughput and average packet delay are derived and investigated for two different receiver models, namely the correlation and chip-level receivers. Both multip...